SurjectiveFunctionEquivalenceof NFA andDFACreate aregularexpressionfor cat & catsDefinecodomainRelationsvs.FunctionsDepth-firstsearchInjectiveFunctionUnioninRegexConcatenationin RegexLevenshteinDistanceKleeneStar inRegexNon-terminalsin a treeDescribeLemmatizationDifferencebetweensetsDefineDFATerminalsin a treeDefineNFAWeakEquivalenceIndexationin a treeBreadth-firstsearchStringDistanceCardinalityDefineDomainBijectiveFunctionSurjectiveFunctionEquivalenceof NFA andDFACreate aregularexpressionfor cat & catsDefinecodomainRelationsvs.FunctionsDepth-firstsearchInjectiveFunctionUnioninRegexConcatenationin RegexLevenshteinDistanceKleeneStar inRegexNon-terminalsin a treeDescribeLemmatizationDifferencebetweensetsDefineDFATerminalsin a treeDefineNFAWeakEquivalenceIndexationin a treeBreadth-firstsearchStringDistanceCardinalityDefineDomainBijectiveFunction

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