digitalcommons.butler.edu/wordways/vol8/iss2/8

Preview meta tags from the digitalcommons.butler.edu website.

Linked Hostnames

6

Search Engine Appearance

Google

https://digitalcommons.butler.edu/wordways/vol8/iss2/8

Initial Bigrams

To my mind, an ideal hardcore logology project should satisfy two conditions: (1) it should be hard enough to force the investigator out of the cozy Webster's Second Unabridged (NI2) and Third Unabridged (NI3) nook, and (2) it should promise complete success -- every last hole filled -- with persistence. AN excellent example is the problem of finding words beginning with each of the 676 possible two-letter combinations, or bigrams. This problem is covered in the section "Zero Redundancy" (ZR) in Dmitri Borgmann's Beyond Language (Scribner's, 1967). Unfortunately, while Dmitri claimed words for 629 of the combinations, he listed only 547 of them and has no record left of most of the remainder.



Bing

Initial Bigrams

https://digitalcommons.butler.edu/wordways/vol8/iss2/8

To my mind, an ideal hardcore logology project should satisfy two conditions: (1) it should be hard enough to force the investigator out of the cozy Webster's Second Unabridged (NI2) and Third Unabridged (NI3) nook, and (2) it should promise complete success -- every last hole filled -- with persistence. AN excellent example is the problem of finding words beginning with each of the 676 possible two-letter combinations, or bigrams. This problem is covered in the section "Zero Redundancy" (ZR) in Dmitri Borgmann's Beyond Language (Scribner's, 1967). Unfortunately, while Dmitri claimed words for 629 of the combinations, he listed only 547 of them and has no record left of most of the remainder.



DuckDuckGo

https://digitalcommons.butler.edu/wordways/vol8/iss2/8

Initial Bigrams

To my mind, an ideal hardcore logology project should satisfy two conditions: (1) it should be hard enough to force the investigator out of the cozy Webster's Second Unabridged (NI2) and Third Unabridged (NI3) nook, and (2) it should promise complete success -- every last hole filled -- with persistence. AN excellent example is the problem of finding words beginning with each of the 676 possible two-letter combinations, or bigrams. This problem is covered in the section "Zero Redundancy" (ZR) in Dmitri Borgmann's Beyond Language (Scribner's, 1967). Unfortunately, while Dmitri claimed words for 629 of the combinations, he listed only 547 of them and has no record left of most of the remainder.

  • General Meta Tags

    20
    • title
      "Initial Bigrams" by Philip M. Cohen
    • charset
      utf-8
    • viewport
      width=device-width
    • article:author
      Philip M. Cohen
    • author
      Philip M. Cohen

  • Open Graph Meta Tags

    5
    • og:title
      Initial Bigrams
    • og:description
      To my mind, an ideal hardcore logology project should satisfy two conditions: (1) it should be hard enough to force the investigator out of the cozy Webster's Second Unabridged (NI2) and Third Unabridged (NI3) nook, and (2) it should promise complete success -- every last hole filled -- with persistence. AN excellent example is the problem of finding words beginning with each of the 676 possible two-letter combinations, or bigrams. This problem is covered in the section "Zero Redundancy" (ZR) in Dmitri Borgmann's Beyond Language (Scribner's, 1967). Unfortunately, while Dmitri claimed words for 629 of the combinations, he listed only 547 of them and has no record left of most of the remainder.
    • og:type
      article
    • og:url
      https://digitalcommons.butler.edu/wordways/vol8/iss2/8
    • og:site_name
      Digital Commons @ Butler University

  • Twitter Meta Tags

    3
    • twitter:title
      Initial Bigrams
    • twitter:description
      To my mind, an ideal hardcore logology project should satisfy two conditions: (1) it should be hard enough to force the investigator out of the cozy Webster's Second Unabridged (NI2) and Third Unabridged (NI3) nook, and (2) it should promise complete success -- every last hole filled -- with persistence. AN excellent example is the problem of finding words beginning with each of the 676 possible two-letter combinations, or bigrams. This problem is covered in the section "Zero Redundancy" (ZR) in Dmitri Borgmann's Beyond Language (Scribner's, 1967). Unfortunately, while Dmitri claimed words for 629 of the combinations, he listed only 547 of them and has no record left of most of the remainder.
    • twitter:card
      summary

  • Item Prop Meta Tags

    2
    • name
      Initial Bigrams
    • description
      To my mind, an ideal hardcore logology project should satisfy two conditions: (1) it should be hard enough to force the investigator out of the cozy Webster's Second Unabridged (NI2) and Third Unabridged (NI3) nook, and (2) it should promise complete success -- every last hole filled -- with persistence. AN excellent example is the problem of finding words beginning with each of the 676 possible two-letter combinations, or bigrams. This problem is covered in the section "Zero Redundancy" (ZR) in Dmitri Borgmann's Beyond Language (Scribner's, 1967). Unfortunately, while Dmitri claimed words for 629 of the combinations, he listed only 547 of them and has no record left of most of the remainder.

  • Link Tags

    5
    • alternate
      /wordways/recent.rss
    • shortcut icon
      /favicon.ico
    • stylesheet
      /wordways/ir-journal-style.css
    • stylesheet
      /assets/floatbox/floatbox.css
    • stylesheet
      /ir-print.css

Links

28