1 / 18

ACRONYM™

ACRONYM™. by Peter Mork 21-Sep-14. Outline. Overview Problem Statement BASIC Algorithm Extensions Conclusions. Outline. Overview Problem Statement BASIC Algorithm Extensions Conclusions. Overview.

kipling
Download Presentation

ACRONYM™

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. ACRONYM™ by Peter Mork 21-Sep-14

  2. Outline • Overview • Problem Statement • BASIC Algorithm • Extensions • Conclusions

  3. Outline • Overview • Problem Statement • BASIC Algorithm • Extensions • Conclusions

  4. Overview • Acronyms (e.g., TLA and ETLA) improve the clarity of exposition:“Seein' as how the VP is such a VIP, shouldn't we keep the VC on the QT cause if it leaks in the VC we could end up an MIA and then we'd all be put on KP.” • Many acronyms are overloaded: • Foo has 5 interpretations • Bar has nearly 4! !

  5. Motivation • Some acronyms are better than others: • Why settle for LESS (Learning Everything about System Schematics) when you can have MORE (Masters Of Reverse Engineering)? • Given a metric for evaluating acronyms: • Clearly Recognizable Acronyms Containing Knowledge(CRACK) can replace Grossly con-Structed Acronyms Serving little or no real purpoSe (GRASS), especially in Great Halls of Education, Technology & Teaching Of Students (GHETTOS).

  6. No Such Metric Exists

  7. Outline • Overview • Problem Statement • BASIC Algorithm • Extensions • Conclusions

  8. Formalities • A is an acronym, whose individual letters are a1, a2, …, ak • A+ is the expansion of A • I(A) is the (English) interpretation of A • We want to find: (A, A+, I(A), I(A+))ℝ

  9. Outline • Overview • Problem Statement • BASIC Algorithm • Extensions • Conclusions

  10. Classification

  11. Classification

  12. Classification

  13. Classification

  14. Classification

  15. Outline • Overview • Problem Statement • BASIC Algorithm • Extensions • Conclusions

  16. Extensions • Tagging • Recursionπ / 3 • UsesXeiπ + 1 • Backronym–√2 • Personalization • Scaling

  17. Outline • Overview • Problem Statement • BASIC Algorithm • Extensions • Conclusions

  18. Contributions • We invented a new word without defining it • We presented a classification for acronyms • We demonstrated extensibility • We mentioned several buzzwords • We used the royal ‘we’

More Related