Knowledge

Applicative universal grammar

Source 📝

487: 204:; phenotype corresponds closely to the actual language, as in the previous graphic. Genotype is a more universal structure for the meaning. For the sake of clearer focus on genotype issues, tree branch order can be rendered so that functions are to the left of their arguments. A more genotypical parse tree looks like this: 77:
AUG has just two primitive types: T for terms, S for "sentences" (though AUG apparently allows for sentence fragments being of type S.) There is one non-primitive type, that returns a function: Oxy. O reduces x and y to another type, xy, that combines the types of x and y, xy. Words can be functions
214:
The intransitive "lives" is typed OTS: the subject is a T, but an S -- a sentence phrase -- must be the resulting type. Why does "in" have type OTOOTSOTS? "In" as a three-place function requires a location ("Boston"; type T), something happening ("lives"; type OTS), and in this example, a subject,
108: 191: 143: 309: 148:
Note that making O a prefix operator obviates the need for parentheses (as in more conventional mathematical orthography), and makes for a more compact presentation on the page.
84: 78:
of this type. The type of a word like "my" (thing) is OTT: it takes something of type T and yields something of type T. "My friend" has a structure like this:
557: 528: 167: 119: 451: 421: 280: 399: 209: 156: 40: 547: 562: 234: 71: 224: 462: 44: 521: 319: 296: 552: 567: 239: 514: 344: 36: 28: 380: 59: 196:
The word "living" gets reduced to the more specific "living in Boston". AUG distinguishes between
161:
AUG allows both forward and backward application of O. Here is the rule for backward application:
439: 388: 340: 268: 67: 447: 417: 276: 249: 229: 407: 363: 323: 103:{\displaystyle {\dfrac {\text{''my'' :: OTT ''friend'' :: T}}{\text{''my friend'' :: T}}}} 74:, there is a brief introduction to AUG. It's paraphrased here, using one of their examples: 244: 498: 541: 392: 300: 24: 348: 32: 486: 384: 63: 412: 356:
COLING '94: Proceedings of the 15th conference on Computational linguistics
367: 327: 275:(1st ed.). Bloomington and Indianapolis: Indiana University Press. 208: 155: 494: 186:{\displaystyle {\dfrac {\text{q :: x p :: Oxy}}{\text{q p :: y}}}} 138:{\displaystyle {\dfrac {\text{p :: Oxy q :: x}}{\text{p q :: y}}}} 35:
theory that views the formation of phrase structure by analogy to
406:, Workshops in Computer Science Series.(IFIP), Springer-Verlag, 47:
are the ideas of functional superposition and stratified types.
349:"Long-Distance Dependencies and Applicative Universal Grammar" 404:
Proceedings of the Glasgow Workshop on Functional Programming
444:
Applicative Grammar as a Semantic Theory of Natural Language
151:
Here is how "my friend lives in Boston" reduces in AUG.
502: 310:
Linguistic Association of Canada and the United States
70:, which describes an implementation of AUG parsing in 172: 170: 124: 122: 89: 87: 463:"An Introduction to Applicative Universal Grammar" 185: 137: 113:Rules can transform p of type Oxy to q of type x: 102: 522: 31:processes in particular languages. This is a 8: 43:. Among the innovations in this approach to 529: 515: 411: 171: 169: 123: 121: 88: 86: 393:"Using Types to Parse Natural Language" 260: 57:Using Types to Parse Natural Language 7: 483: 481: 215:someone who lives, also of type T. 14: 485: 207: 154: 41:applicative programming language 92:''my'' :: OTT ''friend'' :: T 446:. Edinburgh University Press. 235:Combinatory categorial grammar 1: 558:Applicative computing systems 273:A Semiotic Theory of Language 225:Applicative computing systems 17:Applicative universal grammar 501:. You can help Knowledge by 45:natural language processing 584: 480: 301:"Functional Superposition" 27:intended for studying the 23:, is a universal semantic 320:Brigham Young University 461:Sypniewski, Bernard P. 548:Philosophy of language 497:-related article is a 413:10.14236/ewic/FP1995.0 297:Bernard P., Sypniewski 240:Functional programming 187: 139: 104: 55:In the paper entitled 563:Linguistic universals 368:10.3115/991250.991285 328:10.3115/991250.991285 188: 140: 105: 168: 120: 85: 37:function application 442:(January 1, 1977). 440:Shaumyan, Sebastian 389:Shaumyan, Sebastian 341:Sebastian, Shaumyan 269:Shaumyan, Sebastian 345:Segond, Frédérique 183: 181: 135: 133: 100: 98: 95:''my friend'' :: T 68:Sebastian Shaumyan 510: 509: 250:Universal grammar 230:Combinatory logic 180: 179: 176: 175:q :: x p :: Oxy 132: 131: 128: 127:p :: Oxy q :: x 97: 96: 93: 575: 531: 524: 517: 489: 482: 477: 475: 473: 457: 427: 426: 415: 397: 377: 371: 370: 353: 337: 331: 330: 305: 293: 287: 286: 265: 211: 202:genotype grammar 192: 190: 189: 184: 182: 177: 174: 173: 158: 144: 142: 141: 136: 134: 129: 126: 125: 109: 107: 106: 101: 99: 94: 91: 90: 583: 582: 578: 577: 576: 574: 573: 572: 538: 537: 536: 535: 471: 469: 460: 454: 438: 435: 433:Further reading 430: 424: 395: 379: 378: 374: 351: 339: 338: 334: 303: 295: 294: 290: 283: 267: 266: 262: 258: 245:Lambda calculus 221: 166: 165: 118: 117: 83: 82: 53: 12: 11: 5: 581: 579: 571: 570: 565: 560: 555: 553:Formal methods 550: 540: 539: 534: 533: 526: 519: 511: 508: 507: 490: 479: 478: 458: 453:978-0852240762 452: 434: 431: 429: 428: 423:978-3540145806 422: 381:Jones, Mark P. 372: 332: 288: 282:978-0253304728 281: 259: 257: 254: 253: 252: 247: 242: 237: 232: 227: 220: 217: 194: 193: 146: 145: 111: 110: 52: 49: 13: 10: 9: 6: 4: 3: 2: 580: 569: 568:Grammar stubs 566: 564: 561: 559: 556: 554: 551: 549: 546: 545: 543: 532: 527: 525: 520: 518: 513: 512: 506: 504: 500: 496: 491: 488: 484: 468: 464: 459: 455: 449: 445: 441: 437: 436: 432: 425: 419: 414: 409: 405: 401: 400:Turner, David 394: 390: 386: 382: 376: 373: 369: 365: 361: 357: 350: 346: 342: 336: 333: 329: 325: 321: 317: 313: 311: 308:LACUS Forum ( 302: 298: 292: 289: 284: 278: 274: 270: 264: 261: 255: 251: 248: 246: 243: 241: 238: 236: 233: 231: 228: 226: 223: 222: 218: 216: 212: 210: 205: 203: 199: 164: 163: 162: 159: 157: 152: 149: 116: 115: 114: 81: 80: 79: 75: 73: 69: 65: 61: 60:Mark P. Jones 58: 50: 48: 46: 42: 38: 34: 30: 26: 22: 18: 503:expanding it 492: 470:. Retrieved 467:pdfslide.net 466: 443: 403: 375: 359: 355: 335: 315: 307: 291: 272: 263: 213: 206: 201: 197: 195: 160: 153: 150: 147: 112: 76: 56: 54: 25:metalanguage 20: 16: 15: 385:Hudak, Paul 362:: 853–858, 322:: 279–287, 542:Categories 256:References 64:Paul Hudak 33:linguistic 472:April 29, 299:(2009) , 198:phenotype 391:(1995), 347:(1994), 271:(1987). 219:See also 178:q p :: y 130:p q :: y 29:semantic 495:grammar 402:(ed.), 72:Haskell 51:Example 450:  420:  279:  39:in an 493:This 398:, in 396:(PDF) 352:(PDF) 304:(PDF) 19:, or 499:stub 474:2021 448:ISBN 418:ISBN 277:ISBN 200:and 66:and 408:doi 364:doi 324:doi 21:AUG 544:: 465:. 416:, 387:; 383:; 358:, 354:, 343:; 318:, 316:23 314:, 306:, 62:, 530:e 523:t 516:v 505:. 476:. 456:. 410:: 366:: 360:2 326:: 312:) 285:.

Index

metalanguage
semantic
linguistic
function application
applicative programming language
natural language processing
Mark P. Jones
Paul Hudak
Sebastian Shaumyan
Haskell


Applicative computing systems
Combinatory logic
Combinatory categorial grammar
Functional programming
Lambda calculus
Universal grammar
Shaumyan, Sebastian
ISBN
978-0253304728
Bernard P., Sypniewski
"Functional Superposition"
Linguistic Association of Canada and the United States
Brigham Young University
doi
10.3115/991250.991285
Sebastian, Shaumyan
Segond, Frédérique
"Long-Distance Dependencies and Applicative Universal Grammar"

Text is available under the Creative Commons Attribution-ShareAlike License. Additional terms may apply.