A graph unification machine for NL parsing

DOI10.1016/S0898-1221(03)90034-4MaRDI QIDQ597235zbMATH OpenFDO

Authors Vlado Kešelj, Nicholas J. Cercone

Publication date 6 August 2004

Published in Computers & Mathematics with Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/S0898-1221(03)90034-4

zbMATH Keywords

ParsingUnification

Mathematics Subject Classification ID

Logic of natural languages (03B65) Natural language processing (68T50)

Recommendations

• Uniquely parsable unification grammars and their parser implemented in Prolog
• Polynomially parsable unification grammars
• Learning and parsing stochastic unification-based grammars.
• Parsing by successive approximation
• LIGHT -- A constraint language and compiler system for typed-unification grammars

Cites work

• scientific article; zbMATH DE number 43017 (Why is no real title available?)
• scientific article; zbMATH DE number 3395362 (Why is no real title available?)
• Unification: a multidisciplinary survey

Cited in

(5)

• A unification-based, integrated natural language processing system
• Relaxed unification -- proposal
• scientific article; zbMATH DE number 995907 (Why is no real title available?)
• Question answering using unification-based grammar
• Learning and parsing stochastic unification-based grammars.

This page was built for publication: A graph unification machine for NL parsing

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q597235)