IT'S ONLY LIKE I'M WRITING AN ALGORITHM THAT WHICH THEN TRIES TO ALSO AGAIN BASED ON WORD P OCCURRENCE PATTERNS TRY TO LINK TOGETHER MAYBE DIFFERENT ONES OF THOSE OH OKAY I MISUNDERSTOOD THAT THEN SO SO YEAH HOW WOULD IT WORK I MEAN WHAT WOULD UM THE HIS INFORMATION THEN BE USEFUL FOR IN R RAINBOW UM I THOUGHT THE POINT ABOUT THAT WAS THAT WE WOULD PUT UM INTO S UM SERIAL CATEGORIES ALL THE SEGMENTS OF THE SAME TOPIC ACROSS MEETINGS OKAY AND THAT UM SPLITTING AT CATEGORY BOUNDARIES UM SPLITTING AT TOPIC BOUNDARIES WOULD A NICE THING TO DO RATHER THAN JUST SPLITTING SOMEWHERE SO YEAH YEAH YEAH I'M ALSO A BIT B LIKE I'M NOT A HUNDRED PERCENT SURE ABOUT RAINBOW BEING THE RIGHT THING 'CAUSE IT SEEMS THAT RAINBOW DOES IN ITS STRUCTURE QUITE RELY ON HAVING DIFFERENT EXAMPLES OF THE SAME CATEGORY SORT OF IN IN A WAY AND IF YOU JUST HAVE ONE DOCUMENT UM IT STILL CAN FIND OUT WHICH WORDS ARE INFORMATIVE FOR THAT CATEGORY AND WHICH ARE NOT SO IF YOU HAVE JUST ONE DOCUMENT IN EACH CATEGORY AND THERE ARE A LOT OF UM OCCURRENCES OF THE WORD THE IN EACH ONE SO THIS WORD WILL BE NOT VERY INFORMATIVE ACROSS THE CATEGORIES SO IT SHOULD WORK FOR ONE BUT I'M NOT SURE IF HOW EXACTLY IT IT UM CALCULATES EVERYTHING UH I THINK IT'S NOT POSSIBLE TO LOOK THAT UP YOU KNOW WHAT AS A BYPRODUCT OF MY L. S. A. I'LL PROVIDE UM A VOCABULARY LIKE SORT OF A DICTIONARY WHICH FOR EACH WORD GIVES AN ENTROPY SCORE ENTROPY SCORE WHICH JUST TELLS YOU OF HOW MUCH INFORMATION THE PRESENCE OF A WORD TELLS YOU ABOUT WHICH TOPIC IT IS NOT WHICH CATEGORY LIKE I'M NOT I'M NOT LUMPING TOGETHER SEPARATE TOPIC SEGMENTS INTO CATEGORIES BUT JUST LIKE HOW MUCH THIS WORD TELLS YOU ABOUT WH HOW LIKELY THAT W THE OCCURRENCE OF THAT WORD MAKES IT THAT IT'S A SPECIFIC SEGMENT TOPIC SEGMENT WHICH IS SOME MEASURE ALREADY OF HOW WIDESPREAD THIS WORD IS VERSUS HOW SPECIFIC F TO A CERTAIN SEGMENT THAT IS AND I'LL JUST PROVIDE THAT BECAUSE THAT'S JUST NOT MUCH MORE WORK THAN JUST THE USUAL THING AND THEN WE CAN SEE HOW WE CAN TIE THAT IN WITH THE OTHER STUFF SO IF YOU UM KEEP ON WORKING ON RAINBOW MEANWHILE AND TRY TO FIND A WAY HOW TO TIE YOUR RAINBOW STUFF INTO SOME WAY THAT WE CAN ATTACH IT TO A CERTAIN TIME SEGMENT YEAH DON'T KNOW I'M JUST THINKING WH IF IT IT USED IS EACH WORD COMPLETELY UNIQUE LIKE SORT OF DOES IT TREAT EACH WORD EACH OCCURRENCE OF WORD AS A COMPLETELY UNIQUE EVENT OR DOES IT I MEAN NO IT IT HAS TO I MEAN BASICALLY THE THE FORM OF THE WORD IS IMPORTANT RIGHT WE CAN'T JUST REPLACE THE WORD BY AN ARBITRARY STRING BECAUSE IT LOOKS IF THE SAME WORD OCCURS AGAIN AND STUFF UM I DON'T KNOW WHAT YOU MEAN BY THAT IT'S UH WHAT I WAS THINKING IS WHETHER IF WE REPLACE THE WORD BY SOMETHING UNIQUELY ID IDENTIFIABLE THEN IT WOULDN'T MAKE A DIFFERENT WHICH ORDER IT IS BUT THAT WOULDN'T WORK BECAUSE IT NEEDS THE WORD BECAUSE THAT'S ALL IT'S WORKING ON IT'S THE WORD AND THAT LOOKS IF THAT WORD OCCURS AGAIN AND VERSUS HOW OFTEN THAT WORD OCCURS IN OTHER CONTEXT RIGHT SO WE CAN'T ATTACH SOME TYPE OF INFORMATION TO THE WORD JUST TO THE WORD STRING ITSELF LIKE MAKING AN UNDERSCORE MAKING THE TIME OR SOMETHING THAT WOULDN'T WORK SOME KIND OF UM TRUNCATION MAYBE IF YOU ATTACH A NUMBER TO EACH WORD AND SAY THAT IT SHOULD OMIT THE LAST PART UH PROBABLY NOT NO NO YEAH MAYBE I SHOULD TRY SOMETHING DIFFERENT AND JUST PROGRAMME IT FOR MYSELF BECAUSE UM YEAH FOR NOW I MEAN REALLY JUST LIKE YEAH I THINK IF WE WORK TOGETHER ON AN ON AN ENTROPY BASED SCORE IT'S LET ME SEE IF I CAN DEMONSTRATE T I MEAN LET'S JUST KEEP ON TALKING MEANWHILE AND I'LL TRY TO START THAT UP IT'S IT'S IT'S REALLY D IT IT'S A VERY SIMPLE THING BUT IT IT BASICALLY JUST DOES SOMETHING WHICH TELLS YOU HOW SPECIFIC A WORD IS IN A SENSE IT'S IN A IT'S IT'S BASICALLY JUST TO TO A HIGH DEGREE REALLY TELLING YOU HOW R HOW RARE A WORD IS OR HOW COMMON A WORD IS BUT UH AS AS THE FIRST STEP THAT'S PROBABLY FOR FOR A PROTOTYPE FOR NEXT WEEK THAT'S PROBABLY NOT A BAD THING I MEAN EVEN IF IT'S JUST THAT EVEN IF YOU JUST LIKE IF YOU HAVE SEGMENTS WHERE WHERE LOTS OF RARE WORDS OCCUR HIGHLIGHTED IN DARKER RED THAN SEGMENTS WHERE ALL THE VERY COMMON WORDS OCCUR THAT'S JUST THAT'S SOMEWHERE TO START FROM AND IT'S IT'S A BIT MORE SOPHISTICATED THAN THAT BUT THEN DE FACTO IT JUST ENDS UP DOING THAT MOSTLY FROM WHAT I FIGURED OUT UM ACTUALLY I THINK I'M NOT GONNA NOT GONNA START THAT NOW BECAUSE THAT'S PROBABLY GONNA TAKE TOO LONG SO IF WE GET IT ON A WORD BY WORD BASIS WHATEVER YOU DO IT'LL PROBABLY APPEAR IN A WORD BY WORD BASIS AND WHAT YOU HAVE ON A SORT OF SEGMENT BUT NOT QUITE SEGMENT BASE YES YEAH I MEAN I HAVEN'T REALLY DECIDED ON UH HOW TO REALLY GET THE INFORMATION OUT OF THIS NOW BECAUSE UM WHEN I HAVE FOR EXAMPLE UM INCREASED SPEAKER OVERLAP THAT APPLIES TO SEVERAL TURNS OF COURSE BUT I COULD GIVE UM THE INFORMATION ABOUT YEAH HOW HOW IMPORTANT THIS IS TO EACH OF THOSE SEGMENTS 'KAY WHAT ABOUT THE FOLLOWING MODEL I MEAN THIS IS A VERY UNSCIENTIFIC WAY OF DOING IT IN SOME SENSE BUT WHAT IF WE IF WE TAKE TIME AS THE STANDARD UNIT FOR NOW AND SORT OF LIKE MAKE A MASSIVE ONE SEGMENT SPLIT SUPER ARRAY BECAUSE EVERYTHING YOU'RE DOING CAN IN ONE WAY OR THE OTHER BE TI TIED DOWN TO ACTUAL TIME SO IF WE IF WE IF FOR IF FOR EACH ONE SEGMENT TIME SLOT WE COULD ATTACH A VALUE AND THEN IT WOULD BE EASY TO THEN GO BACK WHEN IF WE HAVE THE TIME MARKS HERE AND RE MAP THAT ONTO ONTO THE LENGTH OF A SEGMENT YOU KNOW WHAT I MEAN SO IF YOU HAVE FOR EACH WORD SAY AND WE KNOW THAT WORD STARTS AT THIS SEGMENT AND ENDS AT THAT SEGMENT AND YOU HAVE FOR LIKE FOR SOME TIME PERIOD W THE OVERLAP AND THAT PERIOD ON THE F. ONES AND THAT PERIOD OR SOMETHING SO YOU ALSO HAVE A VALUE WHICH CAN BE TIED DOWN TO A TIME AND THEN WE COULD JUST IN M IN MATLAB OR IN SOMETHING JUST CREATE SOME MASSIVE SUPER ARRAY OF OF THINGS FOR EACH FOR EACH LIKE SORT OF TIME SAMPLING SLOT AND AND CALCULATE A VALUE FOR THIS AND ONCE WE HAVE THIS ARRAY WE CAN GO WITH THE SCRIPT AND SORT OF GO FOR EACH SEGMENT TO THE STARTING AND END TIMES AND SAY OKAY