Computer Science – Artificial Intelligence
Scientific paper
2011-06-30
Journal Of Artificial Intelligence Research, Volume 21, pages 287-317, 2004
Computer Science
Artificial Intelligence
Scientific paper
10.1613/jair.1309
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 by 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.
Nederhof Mark-Jan
Satta Giovanni
No associations
LandOfFree
IDL-Expressions: A Formalism for Representing and Parsing Finite Languages in Natural Language Processing does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with IDL-Expressions: A Formalism for Representing and Parsing Finite Languages in Natural Language Processing, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and IDL-Expressions: A Formalism for Representing and Parsing Finite Languages in Natural Language Processing will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-479946