Paper Info
Title
IDL-expressions: a formalism for representing and parsing finite languages in natural language processing
Abstract
We propose a formalism for representation of finite languages, referred to as the class of IDL-expressions, which combines concepts that were only considered in isolation in existing formalisms. The suggested applications are in natural language processing, more specifically in surface natural language generation and in machine translation, where a sentence is obtained by first generating a large set of candidate sentences, represented in a compact way, and then filtering such a set through a parser. We study several formal properties of IDL-expressions and compare this new formalism with more standard ones. We also present a novel parsing algorithm for IDL-expressions and prove a non-trivial upper bound on its time complexity.
Year
DOI
Venue
2011
10.1613/jair.1309
Journal of Artificial Intelligence Research
Keywords
DocType
Volume
formal property,large set,suggested application,natural language processing,candidate sentence,finite language,machine translation,surface natural language generation,new formalism,time complexity,upper bound,artificial intelligent
Journal
abs/1107.0026
Issue
ISSN
Citations 
1
Journal Of Artificial Intelligence Research, Volume 21, pages 287-317, 2004
9
PageRank 
References 
Authors
0.73
27
2
Name
Order
Citations
PageRank
Mark-jan Nederhof138753.30
Giorgio Satta290290.85