Presentation is loading. Please wait.

Presentation is loading. Please wait.

Computational language: week 9 Finish finite state machines FSA’s for modelling word structure Declarative language models knowledge representation and.

Published by Modified over 9 years ago

Similar presentations

Presentation on theme: "Computational language: week 9 Finish finite state machines FSA’s for modelling word structure Declarative language models knowledge representation and."— Presentation transcript:

1 Computational language: week 9 Finish finite state machines FSA’s for modelling word structure Declarative language models knowledge representation and inheritance non-monotonic or ‘default’ inheritance and lexical knowledge representation multiple inheritance DATR: a lexical knowledge representation language

2 Finite State Automata Deterministic FSAs An FSA whose recognition behaviour is fully determined by the state it is in and the input symbol it is looking at

3 Finite State Automata Deterministic FSAs An FSA whose recognition behaviour is fully determined by the state it is in and the input symbol it is looking at Non-deterministic FSAs An FSA with decision points

4 Finite State Automata Deterministic FSAs Non-deterministic FSAs An FSA with decision points Self-loop may be in a particular state Arcs may have ε transitions

5 Finite State Automata Formal language Set of strings Finite symbol set, alphabet

6 Finite State Automata Formal language Set of strings Finite symbol set, alphabet L(m) = {baa!, ba!, baaa!,…} “formal language characterised by m” m = model L = formal language

7 Finite State Automata Formal language Set of strings Finite symbol set, alphabet L(m) = {baa!, ba!, baaa!,…} A formal language models a fragment of a natural language

8 Finite state transducers and word structure FSA for word structure Handles the morphotactics Arc labels drawn from sets of lexical classes Lexical entries and affixes in the lexicon Achieve morphological recognition

9 Finite state transducers and word structure Finite State Transducers for morphological parsing distinction between surface level and lexical level lexical level includes basic stem and morphosyntactic features cat +N+PL -> cats

10 Finite state transducers and word structure Finite State Transducers for morphological parsing distinction between surface level and lexical level lexical level includes basic stem and morphosyntactic features cat +N+PL -> cats FST: maps one of set of symbols onto another

11 Finite state transducers and word structure Finite State Transducers for morphological parsing distinction between surface level and lexical level lexical level includes basic stem and morphosyntactic features cat +N+PL -> cats FST: maps one of set of symbols onto another c:c a:a t:t +N:εPL:s

12 Finite state transducers and word structure Finite State Transducers for morphological parsing Boundary markers: ^ morpheme boundary # word boundary

13 Finite state transducers and word structure Finite State Transducers for morphological parsing Boundary markers: ^ morpheme boundary # word boundary c:c a:a t:t +N:εPL:^s#

14 Finite state transducers and word structure Finite State Transducers for morphological parsing Boundary markers: ^ morpheme boundary # word boundary c:c a:a t:t +N:εPL:^s# g:g o:e o:e s:s e:e +N:εPL:#

15 Knowledge representation Linguistic knowledge Linguistic facts Relations between linguistic facts Computable

16 Knowledge representation Linguistic knowledge Linguistic facts lexicon Relations between linguistic facts Computable

17 Knowledge representation Linguistic knowledge Linguistic facts lexicon Relations between linguistic facts inference default inference Computable

18 Knowledge representation Linguistic knowledge Linguistic facts lexicon Relations between linguistic facts inference default inference Computable DATR Prolog

19 Knowledge representation and the lexicon Inheritance hierarchy

20 Knowledge representation and the lexicon Inheritance hierarchy A graphical representation of how facts or properties are shared amongst entities

21 Knowledge representation and the lexicon Inheritance hierarchy

22 Knowledge representation and the lexicon Inheritance hierarchy

23 Knowledge representation and the lexicon Inheritance hierarchy

24 Knowledge representation and the lexicon Default inheritance hierarchy

25 Knowledge representation and the lexicon Default inheritance

26 Knowledge representation and the lexicon Default inheritance

27 Knowledge representation and the lexicon Default inheritance

28 Knowledge representation and the lexicon Default inheritance

29 Knowledge representation and the lexicon DATR, lexical knowledge representation language Inference and default inference Compiled in Prolog Developed by Evans and Gazdar Network Morphology

30 Knowledge representation and the lexicon DATR demonstration

31 Lexical knowledge representation Summary Inheritance Inference rules Formalism Computable

Download ppt "Computational language: week 9 Finish finite state machines FSA’s for modelling word structure Declarative language models knowledge representation and."

Similar presentations

Recognising Languages We will tackle the problem of defining languages by considering how we could recognise them. Problem: Is there a method of recognising.

Recognising Languages We will tackle the problem of defining languages by considering how we could recognise them. Problem: Is there a method of recognising.
Finite State Automata. A very simple and intuitive formalism suitable for certain tasks A bit like a flow chart, but can be used for both recognition.

Finite State Automata. A very simple and intuitive formalism suitable for certain tasks A bit like a flow chart, but can be used for both recognition.
4b Lexical analysis Finite Automata

4b Lexical analysis Finite Automata
CS 47051 Morphological Parsing CS 4705. 2 Parsing Taking a surface input and analyzing its components and underlying structure Morphological parsing:

CS Morphological Parsing CS Parsing Taking a surface input and analyzing its components and underlying structure Morphological parsing:
Computational Morphology. Morphology S.Ananiadou2 Outline What is morphology? –Word structure –Types of morphological operation – Levels of affixation.

Computational Morphology. Morphology S.Ananiadou2 Outline What is morphology? –Word structure –Types of morphological operation – Levels of affixation.
Theory Of Automata By Dr. MM Alam

Theory Of Automata By Dr. MM Alam
Chapter 13 1. Section 13.3 2 Section Summary Set of Strings Finite-State Automata Language Recognition by Finite-State Machines Designing Finite-State.

Chapter Section Section Summary Set of Strings Finite-State Automata Language Recognition by Finite-State Machines Designing Finite-State.
Regular Expressions (RE) Used for specifying text search strings. Standarized and used widely (UNIX: vi, perl, grep. Microsoft Word and other text editors…)

Regular Expressions (RE) Used for specifying text search strings. Standarized and used widely (UNIX: vi, perl, grep. Microsoft Word and other text editors…)
6/2/2015CPSC503 Winter 20071 CPSC 503 Computational Linguistics Lecture 2 Giuseppe Carenini.

6/2/2015CPSC503 Winter CPSC 503 Computational Linguistics Lecture 2 Giuseppe Carenini.
LING 438/538 Computational Linguistics Sandiway Fong Lecture 8: 9/29.

LING 438/538 Computational Linguistics Sandiway Fong Lecture 8: 9/29.
1 Regular Expressions and Automata September 10 2009 Lecture #2-2.

1 Regular Expressions and Automata September Lecture #2-2.
Finite-State Automata Shallow Processing Techniques for NLP Ling570 October 5, 2011.

Finite-State Automata Shallow Processing Techniques for NLP Ling570 October 5, 2011.
6/10/2015CPSC503 Winter 20091 CPSC 503 Computational Linguistics Lecture 3 Giuseppe Carenini.

6/10/2015CPSC503 Winter CPSC 503 Computational Linguistics Lecture 3 Giuseppe Carenini.
Finite Automata Finite-state machine with no output. FA consists of States, Transitions between states FA is a 5-tuple Example! A string x is recognized.

Finite Automata Finite-state machine with no output. FA consists of States, Transitions between states FA is a 5-tuple Example! A string x is recognized.
1/7 INFO60021 Natural Language Processing Harold Somers Professor of Language Engineering.

1/7 INFO60021 Natural Language Processing Harold Somers Professor of Language Engineering.
LING 438/538 Computational Linguistics Sandiway Fong Lecture 11: 10/3.

LING 438/538 Computational Linguistics Sandiway Fong Lecture 11: 10/3.
Computational Language Finite State Machines and Regular Expressions.

Computational Language Finite State Machines and Regular Expressions.
Morphology See Harald Trost “Morphology”. Chapter 2 of R Mitkov (ed.) The Oxford Handbook of Computational Linguistics, Oxford (2004): OUP D Jurafsky &

Morphology See Harald Trost “Morphology”. Chapter 2 of R Mitkov (ed.) The Oxford Handbook of Computational Linguistics, Oxford (2004): OUP D Jurafsky &
Finite Automata Chapter 5. Formal Language Definitions Why need formal definitions of language –Define a precise, unambiguous and uniform interpretation.

Finite Automata Chapter 5. Formal Language Definitions Why need formal definitions of language –Define a precise, unambiguous and uniform interpretation.
Finite State Transducers The machine model we will study for morphological parsing is called the finite state transducer (FST) An FST has two tapes –input.

Finite State Transducers The machine model we will study for morphological parsing is called the finite state transducer (FST) An FST has two tapes –input.

Similar presentations

Ads by Google