The equational theory of pomsets
Theoretical Computer Science
A statistical approach to machine translation
Computational Linguistics
The Philips automatic train timetable information system
Speech Communication - Special issue on interactive voice technology for telecommunication applications
Algorithms on strings, trees, and sequences: computer science and computational biology
Algorithms on strings, trees, and sequences: computer science and computational biology
Derivatives of Regular Expressions
Journal of the ACM (JACM)
An Improved Context-Free Recognizer
ACM Transactions on Programming Languages and Systems (TOPLAS)
An efficient context-free parsing algorithm
Communications of the ACM
Speech and Language Processing: An Introduction to Natural Language Processing, Computational Linguistics, and Speech Recognition
Regulated Rewriting in Formal Language Theory
Regulated Rewriting in Formal Language Theory
Introduction to Formal Language Theory
Introduction to Formal Language Theory
The theory of parsing, translation, and compiling
The theory of parsing, translation, and compiling
Context-free error analysis by evaluation of algebraic power series
STOC '73 Proceedings of the fifth annual ACM symposium on Theory of computing
Decoding complexity in word-replacement translation models
Computational Linguistics
Parsing with discontinuous phrases
Natural Language Engineering
Forest-based statistical sentence generation
NAACL 2000 Proceedings of the 1st North American chapter of the Association for Computational Linguistics conference
A logical treatment of semi-free word order and bounded discontinuous constituency
EACL '89 Proceedings of the fourth conference on European chapter of the Association for Computational Linguistics
Deterministic consistency checking of LP constraints
EACL '95 Proceedings of the seventh conference on European chapter of the Association for Computational Linguistics
Generation that exploits corpus-based statistical knowledge
COLING '98 Proceedings of the 17th international conference on Computational linguistics - Volume 1
The structure of shared forests in ambiguous parsing
ACL '89 Proceedings of the 27th annual meeting on Association for Computational Linguistics
Compiling HPSG type constraints into definite clause programs
ACL '95 Proceedings of the 33rd annual meeting on Association for Computational Linguistics
The intersection of finite state automata and definite clause grammars
ACL '95 Proceedings of the 33rd annual meeting on Association for Computational Linguistics
Two-level, many-paths generation
ACL '95 Proceedings of the 33rd annual meeting on Association for Computational Linguistics
Exploiting a probabilistic hierarchical model for generation
COLING '00 Proceedings of the 18th conference on Computational linguistics - Volume 1
Shake-and-bake machine translation
COLING '92 Proceedings of the 14th conference on Computational linguistics - Volume 2
Letting the cat out of the bag: generation for shake-and-bake MT
COLING '92 Proceedings of the 14th conference on Computational linguistics - Volume 2
COLING '92 Proceedings of the 14th conference on Computational linguistics - Volume 2
The language intersection problem for non-recursive context-free grammars
Information and Computation
Immediate-head parsing for language models
ACL '01 Proceedings of the 39th Annual Meeting on Association for Computational Linguistics
RELAX NG
Towards developing generation algorithms for text-to-text applications
ACL '05 Proceedings of the 43rd Annual Meeting on Association for Computational Linguistics
ACL-44 Proceedings of the 21st International Conference on Computational Linguistics and the 44th annual meeting of the Association for Computational Linguistics
Discourse generation using utility-trained coherence models
COLING-ACL '06 Proceedings of the COLING/ACL on Main conference poster sessions
Natural language generation for text-to-text applications using an information-slim representation
AAAI'05 Proceedings of the 20th national conference on Artificial intelligence - Volume 4
IWPT '07 Proceedings of the 10th International Conference on Parsing Technologies
| Hi-index | 0.00 |
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.