DefineNFADefineDomainEquivalenceof NFA andDFARelationsvs.FunctionsCreate aregularexpressionfor cat & catsDepth-firstsearchStringDistanceIndexationin a treeDifferencebetweensetsWeakEquivalenceDescribeLemmatizationKleeneStar inRegexUnioninRegexDefinecodomainBijectiveFunctionTerminalsin a treeNon-terminalsin a treeBreadth-firstsearchSurjectiveFunctionConcatenationin RegexLevenshteinDistanceCardinalityDefineDFAInjectiveFunctionDefineNFADefineDomainEquivalenceof NFA andDFARelationsvs.FunctionsCreate aregularexpressionfor cat & catsDepth-firstsearchStringDistanceIndexationin a treeDifferencebetweensetsWeakEquivalenceDescribeLemmatizationKleeneStar inRegexUnioninRegexDefinecodomainBijectiveFunctionTerminalsin a treeNon-terminalsin a treeBreadth-firstsearchSurjectiveFunctionConcatenationin RegexLevenshteinDistanceCardinalityDefineDFAInjectiveFunction

Computational Linguistics Bingo - Call List

(Print) Use this randomly generated list as your call list when playing the game. There is no need to say the BINGO column name. Place some kind of mark (like an X, a checkmark, a dot, tally mark, etc) on each cell as you announce it, to keep track. You can also cut out each item, place them in a bag and pull words from the bag.


1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
  1. Define NFA
  2. Define Domain
  3. Equivalence of NFA and DFA
  4. Relations vs. Functions
  5. Create a regular expression for cat & cats
  6. Depth-first search
  7. String Distance
  8. Indexation in a tree
  9. Difference between sets
  10. Weak Equivalence
  11. Describe Lemmatization
  12. Kleene Star in Regex
  13. Union in Regex
  14. Define codomain
  15. Bijective Function
  16. Terminals in a tree
  17. Non-terminals in a tree
  18. Breadth-first search
  19. Surjective Function
  20. Concatenation in Regex
  21. Levenshtein Distance
  22. Cardinality
  23. Define DFA
  24. Injective Function