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 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.
Cite
Text
Nederhof and Satta. "IDL-Expressions: A Formalism for Representing and Parsing Finite Languages in Natural Language Processing." Journal of Artificial Intelligence Research, 2004. doi:10.1613/JAIR.1309Markdown
[Nederhof and Satta. "IDL-Expressions: A Formalism for Representing and Parsing Finite Languages in Natural Language Processing." Journal of Artificial Intelligence Research, 2004.](https://mlanthology.org/jair/2004/nederhof2004jair-idlexpressions/) doi:10.1613/JAIR.1309BibTeX
@article{nederhof2004jair-idlexpressions,
title = {{IDL-Expressions: A Formalism for Representing and Parsing Finite Languages in Natural Language Processing}},
author = {Nederhof, Mark-Jan and Satta, Giorgio},
journal = {Journal of Artificial Intelligence Research},
year = {2004},
pages = {287-317},
doi = {10.1613/JAIR.1309},
volume = {21},
url = {https://mlanthology.org/jair/2004/nederhof2004jair-idlexpressions/}
}