Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

Configuration of labeled trees under lexicalized constraints and principles

From MaRDI portal
Publication:1768801
Jump to:navigation, search

DOI10.1023/A:1024639523440zbMath1067.68149OpenAlexW1691218708MaRDI QIDQ1768801

Denys Duchier

Publication date: 15 March 2005

Published in: Research on Language and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1023/a:1024639523440


zbMATH Keywords

configurationconstraint propagationlabeled treesconstraint satisfactionset constraintsparsingdependency grammar


Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Natural language processing (68T50)


Related Items (1)

Taylor dispersion in a two-zone packed tube







This page was built for publication: Configuration of labeled trees under lexicalized constraints and principles

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1768801&oldid=14114805"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 1 February 2024, at 07:35.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki