1 / 16

Introduction to Computational Linguistics

Introduction to Computational Linguistics. Finite State Machines (derived from Ken Beesley). Language and Notation. LANGUAGE. = a set of strings. NOTATION. = a specialised formalism. NOTATION sing s[aiou]ng s.ng (sing|song) [0-9] [0-9][0-9] [0-9]*. LANGUAGE sing

edward
Download Presentation

Introduction to Computational Linguistics

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. Introduction toComputational Linguistics Finite State Machines (derived from Ken Beesley)

  2. Language and Notation LANGUAGE = a set of strings NOTATION = a specialised formalism

  3. NOTATION sing s[aiou]ng s.ng (sing|song) [0-9] [0-9][0-9] [0-9]* LANGUAGE sing sang, sing,song,sung sang, sing,song,sung… sing,song 0,1,2,3,4,5,6,7,8,9 01,02,03,...99 0…9,00…99,000…999… Language and Notation

  4. MACHINE Languages,Notations and Machines LANGUAGE NOTATION

  5. FINITE STATE MACHINE Regular Languages and Finite State Machines REGULAR LANGUAGE describe recognise REGULAR EXPRESSION

  6. Physical Machines with Finite States • The Lightswitch Machine PUSH UP OFF ON PUSH DOWN

  7. Physical Machines with Finite States • The Lightswitch Toggle Machine PUSH OFF ON PUSH

  8. Physical Machines with Finite States • The Fan in Ken Beesley’s Old Car R R R LOW MED HI OFF L L L

  9. Physical Machines with Finite States • Three-Way Lightswitch R R R LOW MED HI OFF R

  10. The Cola Machine • Need to enter 25 cents (USA) to get a drink • Accepts the following coins: • Nickel = 5 cents • Dime = 10 cents • Quarter = 25 cents • For simplicity, our machine needs exact change • We will model only the coin-accepting mechanism

  11. Physical Machines with Finite States • The Cola Machine Start State Final/Accept State N N N N N 5 10 15 20 25 0 D D D D Q

  12. Finite State Automaton • A Finite State Automaton comprises: • An alphabet (a set of symbols) • A set of states of which • one or more is a start state • one or more is a final state • A transition function indicating the transitions between states according to symbols from the alphabet.

  13. Finite State Recognition • A given FSM recognises a string if, from the start state, there is a path to a final state in which each transition is licenced by the transition function applied to successive characters in the string. • An FSM recognises a language if it recognises every string in the language.

  14. The Cola Machine Language • List of all the sequences of coins accepted: • Q • DDN • DND • NDD • DNNN • NDNN • NNDN • NNND • NNNNN • Think of the coins as SYMBOLS or CHARACTERS • The set of symbols accepted is the ALPHABET of the machine • Think of sequences of coins as WORDS or “strings” • The set of words accepted by the machine is its LANGUAGE

  15. Linguistic Machines a n t o c t g i r e m a e s “Apply” m e s a

  16. A Morphological Analyzer Lexical Word Language DOG +PL FSTransducer Surface Word Language DOGS

More Related