Open main menu
Home
Random
Recent changes
Special pages
Community portal
Preferences
About Wikipedia
Disclaimers
Incubator escapee wiki
Search
User menu
Talk
Dark mode
Contributions
Create account
Log in
Editing
Graph theory
(section)
Warning:
You are not logged in. Your IP address will be publicly visible if you make any edits. If you
log in
or
create an account
, your edits will be attributed to your username, along with other benefits.
Anti-spam check. Do
not
fill this in!
=== Linguistics === Graph-theoretic methods, in various forms, have proven particularly useful in [[linguistics]], since natural language often lends itself well to discrete structure. Traditionally, [[syntax]] and compositional semantics follow tree-based structures, whose expressive power lies in the [[principle of compositionality]], modeled in a hierarchical graph. More contemporary approaches such as [[head-driven phrase structure grammar]] model the syntax of natural language using [[feature structure|typed feature structure]]s, which are [[directed acyclic graph]]s. Within [[lexical semantics]], especially as applied to computers, modeling word meaning is easier when a given word is understood in terms of related words; [[semantic network]]s are therefore important in [[computational linguistics]]. Still, other methods in phonology (e.g. [[optimality theory]], which uses [[lattice graph]]s) and morphology (e.g. finite-state morphology, using [[finite-state transducer]]s) are common in the analysis of language as a graph. Indeed, the usefulness of this area of mathematics to linguistics has borne organizations such as [http://www.textgraphs.org/ TextGraphs], as well as various 'Net' projects, such as [[WordNet]], [[VerbNet]], and others.
Edit summary
(Briefly describe your changes)
By publishing changes, you agree to the
Terms of Use
, and you irrevocably agree to release your contribution under the
CC BY-SA 4.0 License
and the
GFDL
. You agree that a hyperlink or URL is sufficient attribution under the Creative Commons license.
Cancel
Editing help
(opens in new window)