Underspecified computation of normal forms

DOI10.4230/LIPICS.RTA.2010.177MaRDI QIDQ5389144zbMATH OpenOpenAlexFDO

Authors Alexander Koller, Stefan Thater

Publication date 25 April 2012

Full work available at URL http://subs.emis.de/LIPIcs/frontdoor_344b.html

zbMATH Keywords

computational linguisticsincomplete inferencenormal formsrewrite systemstree automata

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42) Formal languages and automata (68Q45) Natural language processing (68T50)

Recommendations

• Computation of normal forms
• scientific article; zbMATH DE number 17895
• On Normal Form Computations
• Computation of normal forms via a perturbation technique
• scientific article; zbMATH DE number 1760512
• A recursive approach to compute normal forms
• Symbolic computation of normal forms for semi-simple cases
• Ways of computing a normal form
• scientific article; zbMATH DE number 554750
• scientific article; zbMATH DE number 5263114

Cited in

(4)

• Symbolic computation of normal forms for semi-simple cases
• Some computational problems related to Boyce-Codd normal form
• On Normal Form Computations
• Computing Tiny Clause Normal Forms

This page was built for publication: Underspecified computation of normal forms

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